Reachability and confluence are undecidable for flat term rewriting systemsJACQUEMARD, Florent.Information processing letters. 2003, Vol 87, Num 5, pp 265-270, issn 0020-0190, 6 p.Article

Ground reducibility is EXPTIME-completeCOMON, Hubert; JACQUEMARD, Florent.Information and computation (Print). 2003, Vol 187, Num 1, pp 123-153, issn 0890-5401, 31 p.Article

Automates d'arbres et réécriture de termes = Tree automata and term rewritingJacquemard, Florent; Comon, Hubert.1996, 217 p.Thesis

Compiling and verifying security protocolsJACQUEMARD, Florent; RUSINOWITCH, Michaël; VIGNERON, Laurent et al.Lecture notes in computer science. 2000, pp 131-160, issn 0302-9743, isbn 3-540-41285-9Conference Paper

The confluence problem for flat TRSsMITSUHASHI, Ichiro; OYAMAGUCH, Michio; JACQUEMARD, Florent et al.Lecture notes in computer science. 2006, pp 68-81, issn 0302-9743, isbn 3-540-39728-0, 1Vol, 14 p.Conference Paper

Rigid tree automata and applicationsJACQUEMARD, Florent; KLAY, Francis; VACHER, Camille et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 486-512, issn 0890-5401, 27 p.Conference Paper

Formalisation des relations temporelles dans un contexte d'accompagnement automatique: Stratégies de synchronisation et gestion des erreursECHEVESTE, José; CONT, Arshia; GIAVITTO, Jean-Louis et al.Journal européen des systèmes automatisés. 2011, Vol 45, Num 1-3, pp 109-124, issn 1269-6935, 16 p.Conference Paper